On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
نویسندگان
چکیده
The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called “Branch-and-Prune”. It was observed empirically that the number of solutions of YES instances is always a power of two. We give a proof that this event happens with probability one.
منابع مشابه
A Clifford Algebra approach to the Discretizable Molecular Distance Geometry Problem
The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.
متن کاملExploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem
The Discretizable Molecular Distance Geometry Problem (DMDGP) involves a subset of instances of the distance geometry problem for which some assumptions allowing for discretization are satisfied. The search domain for the DMDGP is a binary tree that can be efficiently explored by employing a Branch & Prune (BP) algorithm. We showed in recent works that this binary tree may contain several symme...
متن کاملThe Branch and Prune Algorithm for the Molecular Distance Geometry Problem with Inexact Distances
The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of distance geometry instances (related to molecules) that can be solved by combinatorial optimization. A modified version of the Branch and Prune (BP) algorithm, previously proposed for solving these instances, is presented, where it is supposed that exact distances are not known, but rather intervals where th...
متن کاملThe discretizable distance geometry problem
We introduce the Discretizable Distance Geometry Problem in R (DDGP3), which consists in a subclass of instances of the Distance Geometry Problem for which an embedding in R can be found by means of a discrete search. We show that the DDGP3 is a generalization of the Discretizable Molecular Distance Geometry Problem (DMDGP), and we discuss the main differences between the two problems. We prove...
متن کاملThe discretizable molecular distance geometry problem
Given a simple weighted undirected graph G = (V,E, d) with d : E → R+, the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x : V → R such that ||xu −xv|| = duv for each {u, v} ∈ E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). W...
متن کامل